Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое abstract class - определение
FEATURE OF A PROGRAMMING LANGUAGE
Abstract class; Pure virtual class
Найдено результатов: 4962
abstract class
<programming> In object-oriented programming, a class
designed only as a parent from which sub-classes may be
derived, but which is not itself suitable for instantiation.
Often used to "abstract out" incomplete sets of features which
may then be shared by a group of sibling sub-classes which add
different variations of the missing pieces.
(1994-11-08)
Abstract type
In programming languages, an abstract type is a type in a nominative type system that cannot be instantiated directly; a type that is not abstract – which can be instantiated – is called a concrete type. Every instance of an abstract type is an instance of some concrete subtype.
Abstract elementary class
CLASS OF MODELS WITH A PARTIAL ORDER SIMILAR TO THE RELATION OF AN ELEMENTARY SUBSTRUCTURE OF AN ELEMENTARY CLASS IN FIRST-ORDER MODEL THEORY
Abstract Elementary Class; Abstract elementary classes
In model theory, a discipline within mathematical logic, an abstract elementary class, or AEC for short, is a class of models with a partial order similar to the relation of an elementary substructure of an elementary class in first-order model theory. They were introduced by Saharon Shelah..
Abstract machine
![A run of a [[Turing machine]].](https://commons.wikimedia.org/wiki/Special:FilePath/2-state 3-symbol Turing Machine.png?width=200 "A run of a [[Turing machine]].")
![Pictorial representation of a [[Krivine machine]].](https://commons.wikimedia.org/wiki/Special:FilePath/Machine de Krivine.jpg?width=200 "Pictorial representation of a [[Krivine machine]].")
THEORETICAL MODEL OF A COMPUTER HARDWARE OR SOFTWARE SYSTEM USED IN AUTOMATA THEORY
Abstract computer; Abstract Machine
An abstract machine is a computer science theoretical model that allows for a detailed and precise analysis of how a computer system functions. It is analogous to a mathematical function in that it receives inputs and produces outputs based on predefined rules. Abstract machines vary from literal machines in that they are expected to perform correctly and independently of hardware. Abstract machines are “machines” because they allow step-by-step execution of programmes; they are “abstract” because they ignore many aspects of actual (hardware) machines. A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter. They can be used for purely theoretical reasons as well as models for real-world computer systems. In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyse the complexity of algorithms. This use of abstract machines is connected to th
abstract machine
THEORETICAL MODEL OF A COMPUTER HARDWARE OR SOFTWARE SYSTEM USED IN AUTOMATA THEORY
Abstract computer; Abstract Machine
1. <language> A processor design which is not intended to be
implemented as hardware, but which is the notional executor
of a particular intermediate language (abstract machine
language) used in a compiler or interpreter. An abstract
machine has an instruction set, a register set and a model
of memory. It may provide instructions which are closer to
the language being compiled than any physical computer or it
may be used to make the language implementation easier to
port to other platforms.
A virtual machine is an abstract machine for which an
interpreter exists.
Examples: ABC, Abstract Machine Notation, ALF, CAML,
F-code, FP/M, Hermes, LOWL,
Christmas, SDL, S-K reduction machine, SECD, Tbl,
Tcode, TL0, WAM.
2. <theory> A procedure for executing a set of instructions in
some formal language, possibly also taking in input data and
producing output. Such abstract machines are not intended to
be constructed as hardware but are used in thought
experiments about computability.
Examples: Finite State Machine, Turing Machine.
(1995-03-13)
List of abstract algebra topics
WIKIMEDIA LIST ARTICLE
Outline of abstract algebra; Glossary of abstract algebra
Abstract algebra is the subject area of mathematics that studies algebraic structures, such as groups, rings, fields, modules, vector spaces, and algebras. The phrase abstract algebra was coined at the turn of the 20th century to distinguish this area from what was normally referred to as algebra, the study of the rules for manipulating formulae and algebraic expressions involving unknowns and real or complex numbers, often now called elementary algebra.
Tame abstract elementary class
ABSTRACT ELEMENTARY CLASS WHICH SATISFIES A LOCALITY PROPERTY FOR TYPES
In model theory, a discipline within the field of mathematical logic, a tame abstract elementary class is an abstract elementary class (AEC) which satisfies a locality property for types called tameness. Even though it appears implicitly in earlier work of Shelah, tameness as a property of AEC was first isolated by Grossberg and VanDieren,.
Abstract labour and concrete labour
FORM OF LABOUR
Abstract labour; Concrete labour; Twofold labour; Abstract labor and concrete labor
Abstract labour and concrete labour refer to a distinction made by Karl Marx in his critique of political economy. It refers to the difference between human labour in general as economically valuable worktime versus human labour as a particular activity that has a specific useful effect within the (capitalist) mode of production.
concrete class
IN OBJECT-ORIENTED PROGRAMMING, A DEFINITION THAT SPECIFIES HOW AN OBJECT WORKS
Class in object-oriented programming; Class (object-oriented programming); Concrete class; Class type; Partial type; Classes (computer science); Class (software); Class (programming); Class definition; Partial class; Software classes; Partial Classes; Partial Class; Concrete instance; Abstract base class; Abstract superclass; Class (computing); Partial classes; Sealed classes; Sealed class; Class programming; Anonymous class; Member visibility; Private member; Public member; Protected member; Private variables and methods; Private method; Private variable; Class (computer science); Protected (class); Protected (computer programming); Class attributes (computer programming); Class properties; Class property; Member accessibility; Open class (computer programming)
<programming> In object-oriented programming, a class
suitable to be instantiated, as opposed to an {abstract
class}.
(1995-05-01)
private member
IN OBJECT-ORIENTED PROGRAMMING, A DEFINITION THAT SPECIFIES HOW AN OBJECT WORKS
Class in object-oriented programming; Class (object-oriented programming); Concrete class; Class type; Partial type; Classes (computer science); Class (software); Class (programming); Class definition; Partial class; Software classes; Partial Classes; Partial Class; Concrete instance; Abstract base class; Abstract superclass; Class (computing); Partial classes; Sealed classes; Sealed class; Class programming; Anonymous class; Member visibility; Private member; Public member; Protected member; Private variables and methods; Private method; Private variable; Class (computer science); Protected (class); Protected (computer programming); Class attributes (computer programming); Class properties; Class property; Member accessibility; Open class (computer programming)
¦ noun (in the UK, Canada, Australia, and New Zealand) a member of a parliament who is not a minister or does not hold government office.
Википедия
Abstract type
In programming languages, an abstract type is a type in a nominative type system that cannot be instantiated directly; a type that is not abstract – which can be instantiated – is called a concrete type. Every instance of an abstract type is an instance of some concrete subtype. Abstract types are also known as existential types.
An abstract type may provide no implementation, or an incomplete implementation. In some languages, abstract types with no implementation (rather than an incomplete implementation) are known as protocols, interfaces, signatures, or class types. In class-based object-oriented programming, abstract types are implemented as abstract classes (also known as abstract base classes), and concrete types as concrete classes. In generic programming, the analogous notion is a concept, which similarly specifies syntax and semantics, but does not require a subtype relationship: two unrelated types may satisfy the same concept.
Often, abstract types will have one or more implementations provided separately, for example, in the form of concrete subtypes that can be instantiated. In object-oriented programming, an abstract class may include abstract methods or abstract properties that are shared by its subclasses. Other names for language features that are (or may be) used to implement abstract types include traits, mixins, flavors, roles, or type classes.
